Analytic Functions Computable by Finite State Transducers
نویسندگان
چکیده
We show that the only analytic functions computable by finite state transducers in sofic Möbius number systems are Möbius transformations.
منابع مشابه
Finite-State Complexity and the Size of Transducers
Finite-state complexity is a variant of algorithmic information theory obtained by replacing Turing machines with finite transducers. We consider the state-size of transducers needed for minimal descriptions of arbitrary strings and, as our main result, show that the state-size hierarchy with respect to a standard encoding is infinite. We consider also hierarchies yielded by more general comput...
متن کاملState-Size Hierarchy for Finite-State Complexity
Finite-state complexity is a variant of algorithmic information theory obtained by replacing Turing machines with finite transducers. We consider the number of states needed for transducers used in minimal descriptions of arbitrary strings and, as our main result, show that the state-size hierarchy with respect to a standard encoding is infinite. We consider corresponding hierarchies yielded by...
متن کاملLipschitz Robustness of Finite-state Transducers
We investigate the problem of checking if a finite-state transducer is robust to uncertainty in its input. Our notion of robustness is based on the analytic notion of Lipschitz continuity — a transducer is K-(Lipschitz) robust if the perturbation in its output is at most K times the perturbation in its input. We quantify input and output perturbation using similarity functions. We show that K-r...
متن کاملFinite-State Complexity and Randomness
In this paper we develop a version of Algorithmic Information Theory (AIT) by replacing Turing machines with finite transducers; the complexity induced is called finite-state complexity. In spite of the fact that the Universality Theorem (true for Turing machines) is false for finite transducers, we show that the set of finite transducers can be enumerated by a prefix-free regular set, and, as ...
متن کامل1 the Complexity of a Counting Finite - State Automaton
A counting finite-state automaton is a nondeterministic finite-state automaton which, on an input over its input alphabet, (magically) writes in binary the number of accepting computations on the input. We examine the complexity of computing the counting function of an NFA, and the complexity of recognizing its range as a set of binary strings. We also consider the pumping behavior of counting ...
متن کامل